Fast DES Implementations for FPGAs and itsApplication to a Universal Key - Search Machine ?

نویسنده

  • Jens-Peter Kaps
چکیده

Most modern security protocols and security applications are deened to be algorithm independent, that is, they allow a choice from a set of cryptographic algorithms for the same function. Therefore a key-search machine which is also deened to be algorithm independent might be interesting. We researched the feasibility of a universal key-search machine using the Data Encryption Standard (DES) as an example algorithm. Field Programmable Gate Arrays (FPGA) provide an ideal match for an algorithm independent cracker as they can switch algorithms on-they and run much faster than software. We designed, implemented and compared various architecture options of DES with strong emphasis on high-speed performance. Techniques like pipelining and loop unrolling were used and their eeectiveness for DES on FPGAs investigated. The most interesting result is that we could achieve data rates of up to 403 Mbit/s using a standard Xilinx FPGA. This result is by a factor 31 faster than software implementations while we are still maintaining exibility. A DES cracker chip based on this design could search 6.29 million keys per second.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast DES Implementation for FPGAs and Its Application to a Universal Key-Search Machine

Most modern security protocols and security applications are deened to be algorithm independent, that is, they allow a choice from a set of cryptographic algorithms for the same function. Therefore a key-search machine which is also deened to be algorithm independent might be interesting. We researched the feasibility of a universal key-search machine using the Data Encryption Standard (DES) as...

متن کامل

Efficient Uses of FPGAs for Implementations of DES and Its Experimental Linear Cryptanalysis

In its basic version, linear cryptanalysis is a known-plaintext attack that uses a linear relation between input-bits, outputbits, and key-bits of an encryption algorithm that holds with a certain probability. If enough plaintext-ciphertext pairs are provided, this approximation can be used to assign probabilities to the possible keys and to locate the most probable one. In 1993, Matsui applied...

متن کامل

Fine grain parallelism on a MIMD machine using FPGAs

Current MIMD machines are used for coarse grain-parallelism and also ooer messsage passing mechanisms to deal with inter-processor communications. But these mechanisms lack eeciency in ne-grain parallel applications such as systolic computation. This article presents the use of an FPGA chip to set up a fast systolic communication agent on a linear asynchronous network of Transputer processors; ...

متن کامل

Fast SFFS-Based Algorithm for Feature Selection in Biomedical Datasets

Biomedical datasets usually include a large number of features relative to the number of samples. However, some data dimensions may be less relevant or even irrelevant to the output class. Selection of an optimal subset of features is critical, not only to reduce the processing cost but also to improve the classification results. To this end, this paper presents a hybrid method of filter and wr...

متن کامل

A Coarse-Grain Hierarchical Technique for 2-Dimensional FFT on Configurable Parallel Computers

FPGAs (Field-Programmable Gate Arrays) have been widely used as coprocessors to boost the performance of data-intensive applications [1][2]. However, there are several challenges to further boost FPGA performance: the communication overhead between the host workstation and the FPGAs can be substantial; large-scale applications cannot fit in a single FPGA because of its limited capacity; mapping...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005